A Graph Rewriting Approach for Converting Asynchronous ROMs into Synchronous Ones

نویسندگان

  • Md. Nazrul Islam Mondal
  • Koji Nakano
  • Yasuaki Ito
چکیده

Most of FPGAs have Configurable Logic Blocks (CLBs) to implement combinational and sequential circuits and block RAMs to implement Random Access Memories (RAMs) and Read Only Memories (ROMs). Circuit design that minimizes the number of clock cycles is easy if we use asynchronous read operations. However, most of FPGAs support synchronous read operations, but do not support asynchronous read operations. The main contribution of this paper is to provide one of the potent approaches to resolve this problem. We assume that a circuit using asynchronous ROMs designed by a non-expert or quickly designed by an expert is given. Our goal is to convert this circuit with asynchronous ROMs into an equivalent circuit with synchronous ones. The resulting circuit with synchronous ROMs can be embedded into FPGAs. We also discuss several techniques to decrease the latency and increase the clock frequency of the resulting circuits. key words: FPGA, block RAMs, asynchronous read operations, rewriting algorithm

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Synchronous and Asynchronous Graph Transformations

Synchronous and asynchronous graph transformations are discussed on the basis of distributed graph transformations. All types of graph transformations presented are formulated in the single-pushout approach to graph transformations and compared with each other. Some criteria are given to preserve or reestablish synchrony according to the deenition proposed in this paper.

متن کامل

An Algorithm to Obtain Circuits with Synchronous RAMs

Field Programmable Gate Arrays (FPGAs) are used to embed a circuit designed by users instantly. Most of FPGAs have Configurable Logic Blocks (CLBs) to implement combinational and sequential circuits and block RAMs to implement Random Access Memories (RAMs) and Read Only Memories (ROMs). Circuit design that minimizes the number of clock cycles is easy if we use asynchronous read operations. Howe...

متن کامل

Asynchronous Mobile Processes and Graph Rewriting

Honda and Tokoro provide a formal system for communicating systems developed from Milner's {calculus. Unlike other formalisms, their work is based on asynchronous communication primitives. This paper proposes some minor but practically signiicant extensions to a model based on asynchronous communication and shows how the resulting system may be mapped very directly onto a graph rewriting system...

متن کامل

Synthesis of Externally Synchronous, Internally Asynchronous Circuits

The purpose of this work is to take an arbitrary 2phase synchronous circuit and eliminate its global clock while preserving its externally visible behavior. This is done by converting it into a set of self-timed combinational circuits with latches and a clock generation network that uses only a local handshake. We discuss the overhead required by this approach to selftiming and outline opportun...

متن کامل

An asynchronous traversal engine for graph-based rich metadata management

Rich metadata in high-performance computing (HPC) systems contains extended information about users, jobs, data files, and their relationships. Property graphs are a promising data model to represent heterogeneous rich metadata flexibly. Specifically, a property graph can use vertices to represent different entities and edges to record the relationships between vertices with unique annotations....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 94-D  شماره 

صفحات  -

تاریخ انتشار 2011